|
|
Parser and Validator of Data Models in YANG Language
Vican, Pavol ; Kekely, Lukáš (referee) ; Kořenek, Jan (advisor)
Computer network administrators need tools for configuration and monitoring of network devices. Therefore, NETCONF protocol was designed for remote devices configuration and YANG modelling language which describes the structure of the configuration data. The aim of this thesis is to extend the libyang library with syntax parser, that processes models written in YANG and stores them into internal structures. This parser is generated by bison and flex tools.
|
|
|
Detection and Error Recovery for Syntactic Analysis
Sák, Vladimír ; Dolíhal, Luděk (referee) ; Zámečníková, Eva (advisor)
Bachelor's thesis deals with error detection and recovery for syntactic analysis. The main goal of work was to design and implement a method for error detection and recovery. The proposed method is based on the Hartmann method for error detection and error recovery. The user interface, using cross-platform framework Qt was also implemented. As a result, the application prints all of the information about errors while parsing the source code.
|
|
|
Compiler of a Language with User-Defined Syntax for New Constructs
Kuklínek, Lukáš ; Křivka, Zbyněk (referee) ; Kolář, Dušan (advisor)
Tato práce si klade za cíl navrhnout a implementovat experimentální programovací jazyk s podporou uživatelsky definovaných syntaktických konstrukcí. Nový jazyk je kompilován do nativní binární podoby a vyžaduje statickou typovou disciplínu v době překladu. Jazyk se skládá ze dvou hlavních komponent. První z nich je minimalistické jádro založené na principech zásobníkově orientovaných jazyků. Druhou částí je mechanismus pro definici nových syntaktických konstrukcí uživatelem. Poté jsou shrnuty poznatky nabyté při návrhu a experimentování s prototypem překladače tohoto jazyka.
|
|
|
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
|
|
|
Parallel Parsing
Holko, Maroš ; Regéciová, Dominika (referee) ; Meduna, Alexandr (advisor)
The goal of this bachelor thesis is to create and implement a parallel version of a Cocke-Younger-Kasami algorithm, which is used for syntactic analysis. This algorithm works with context-free grammars, so a big part of this work is dedicated to context-free grammars and their transformation to the Chomsky normal form. Output of this thesis is console application in C++ which use threads for parallel processing. There is also an extension for finding all rule successions for given input string designed and implemented. In the end there is a discussion about program's advantages and disadvantages.
|
|
|
Modified Parsing
Sopuch, Zbyněk ; Rychnovský, Lukáš (referee) ; Meduna, Alexandr (advisor)
This project deals with modification of syntax analysis. I realize three modifications of bottom up algorithm. First way is modification of Cocke-Younger-Kasami algorithm, second is based on EOL system and third is based on ETOL system.
|
|
|
Data Acquisition from HTML Sites
Komenda, Tomáš ; Šimek, Václav (referee) ; Straka, Martin (advisor)
This work describes scope of creating application for extraction and following data from HTML sites. This work engages in lexical analyze and parsing HTML. This work describes filtration of data from HTML sites. This work describes saving of data in database and XML documents, creating of dynamic HTMP pages, timer cron, GNU utility wget, sending of SMS, sending email and extraction of date from internet. Final chapters describe two web applications. These applications follow data from HTML sites and inform users about changes.
|
|
|
Application for Detection of Plagiarism
Kačic, Matej ; Přikryl, Zdeněk (referee) ; Lukáš, Roman (advisor)
Main goal of this thesis is to create application, which can detect plagiarism in program code of projects without skeleton. It describes constructions of C/C++ language and their usage for detection of plagiarism. Projetcs are analysed by preprocesor, lexical analyse and phase of making structure of compare. After that they are compared one to each another by statistical test and Body test depends on Longest common subsequence.
|
|
|
Parsing Based on Tree-Controled Grammars
Granát, Štěpán ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to design and implement the parser of grammars, whose derivation tree is limited by inspection of levels. Common parsing procedures are studied in detail and then it is discussed, how they could be extended by inspection of derivation tree. The most important part of the thesis is a draft of continuous inspection of the derivation tree simultaneously with its construction, which allows close cooperation between these two processes. This approach enables significant increasing of the parser power.
|
|
|
Parsing Based on Grammar and Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focusing especially on impacts of nondeterminism in individual components on the whole system. Also it introduces a proposal of algorithm for converting some parallel communicating grammar systems to parallel communicating pushdown automata systems. The gained knowledge is used to design and implement parsing method.
|
guest ::
